Brooksʼ Theorem for generalized dart graphs
نویسندگان
چکیده
The well-known Brooks’ Theorem says that each graph G of maximum degree k ≥ 3 is k-colorable unless G = Kk+1. We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood.
منابع مشابه
AN LP-LQ-VERSION OF MORGAN’S THEOREM FOR THE GENERALIZED BESSEL TRANSFORM
n this article, we prove An Lp-Lq-version of Morgan’s theorem for the generalized Bessel transform.
متن کاملGENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES
The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.
متن کاملAn Lp-Lq-version Of Morgan's Theorem For The Generalized Fourier Transform Associated with a Dunkl Type Operator
The aim of this paper is to prove new quantitative uncertainty principle for the generalized Fourier transform connected with a Dunkl type operator on the real line. More precisely we prove An Lp-Lq-version of Morgan's theorem.
متن کاملMaximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a ch...
متن کاملRecognizing Dart - Free Perfect Graphs 1317
A graph G is called a Berge graph if neither G nor its complement contains a chordless cycle whose length is odd and at least five; what we call a dart is the graph with vertices u, v, w, x, y and edges uv, vw, uy, vy, wy, xy; a graph is called dart-free if it has no induced subgraph isomorphic to the dart. We present a polynomial-time algorithm to recognize dart-free Berge graphs; this algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012